Technical Report On Buffered Clos Switches

نویسندگان

  • Santosh Krishnan
  • Henning G. Schulzrinne
چکیده

There is a widespread interest in switching architectures that can scale in capacity with increasing interface transmission rates and higher port counts. Furthermore, packet switches that provide Quality of Service (QoS), such as bandwidth and delay guarantees, to the served user traffic are also highly desired. This report addresses the issue of constructing a high-capacity QoS-capable, multi-module switching node. Output queued switches provide the best performance in terms of throughput as well as QoS but do not scale. Input queued switches, on the other hand, require complex arbitration procedures to achieve the same level of performance. We enumerate the design constraints in the construction of a packet switch and present several approaches to build a system composed of lower-capacity memory and space elements, and analyze their performance. Towards this goal, we establish a new taxonomy for a class of switches, which we call Buffered Clos switches, and present a formal framework for optimal packet switching performance, in terms of both throughput and QoS. Within the taxonomy, we augment the existing combined input-output queueing (CIOQ) systems with Aggregation and Pipelining techniques. Furthermore, we present the design and analysis of a novel parallel packet switch architecture. For the items in the taxonomy, we present algorithms that provide optimal throughput and QoS, in accordance with the above performance framework. While some of the presented ideas are still in the investigative stage, we believe that the current state of the work, especially the formal treatment of switching, will be beneficial to the ongoing research in the field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches

AbslradThe Clos-nehuork is widely recognized as a s.ealable arehitechlre for high-performance switches and routerr. Since more contention points are introduced in the multistage network, eel1 buffers are commonly used to resolve the contention. Recently, several scheduling algorithms hare been proposed for the buffered ClosNetwork switches. These approaches will came either mis-sequence or memo...

متن کامل

Design and Simulation of Output Queuing with the Middle Stage Buffered (OQMB) Clos Packet Switching Network

Clos network, a family of multistage networks, are attractive alternative for constructing scalable packet switches because of its distributed and modular design. The clos packet switching networks are the next step in scaling current crossbar switches to large number of ports. This paper presents the design and simulation of buffer lessbuffered-buffered Clos Packet switching network architectu...

متن کامل

Three-Stage Clos-Network Switch Architecture with Buffered Center Stage for Multi-Class Traffic

Memory-space-memory (MSM) arrangement is a popular architecture to implement three-stage Clos-network switches with distributed arbitration. The scalability of this architecture, however, is limited by the round-trip communication delay between the first and the second stages. Moreover, virtual output queue (VOQ) does not completely remove the blocking in the buffered modules under multi-class ...

متن کامل

Using Clos Switches in Area Efficient Asynchronous SDM Routers

Most of current asynchronous on-chip routers use the virtual channel flow control method which compromises throughput and latency. Instead of using virtual channels, an asynchronous spatial division multiplexing (SDM) router has been proposed recently. The major design overhead of an SDM router is the enlarged central switch which increases proportionally to the number of virtual circuits. Clos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002